GMRES-type methods for inconsistent systems
نویسندگان
چکیده
منابع مشابه
Gmres-type Methods for Inconsistent Systems
Throughout this paper the integer l is defined by (1.3). Saad and Schulz [6, Proposition 2] show that when A is nonsingular and m ≥ l, the solution xm of the minimization problem (1.2) solves the linear system (1.1). The GMRES method is often implemented by first computing an orthogonal basis {vj} min{m,l} j=1 of the Krylov subspace Km(A, r0) by Arnoldi’s method; see Saad [7] or Saad and Schult...
متن کاملAugmented GMRES-type methods
GMRES is a popular iterative method for the solution of large linear systems of equations with a square nonsymmetric matrix. The method generates a Krylov subspace in which an approximate solution is determined. We present modifications of the GMRES and the closely related RRGMRES methods that allow augmentation of the Krylov subspaces generated by these methods by a user-supplied subspace. We ...
متن کاملTwo recursive GMRES-type methods for shifted linear systems with general preconditioning
We present two minimum residual methods for solving sequences of shifted linear systems, the right-preconditioned shifted GMRES and shifted Recycled GMRES algorithms which use a seed projection strategy often employed to solve multiple related problems. These methods are compatible with general preconditioning of all systems, and when restricted to right preconditioning, require no extra applic...
متن کاملMethods for knowledge reduction in inconsistent ordered information systems
Knowledge reduction is one of the most important problems in the study of rough set theory. However, in real-world, most of information systems are based on dominance relations in stead of the classical equivalence relation because of various factors. The ordering of properties of attributes plays a crucial role in those systems. To acquire brief decision rules from the systems, knowledge reduc...
متن کاملMultipreconditioned Gmres for Shifted Systems
An implementation of GMRES with multiple preconditioners (MPGMRES) is proposed for solving shifted linear systems with shift-and-invert preconditioners. With this type of preconditioner, the Krylov subspace can be built without requiring the matrix-vector product with the shifted matrix. Furthermore, the multipreconditioned search space is shown to grow only linearly with the number of precondi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00064-1